#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <set>
#include "tree.h"

using namespace std;

void zigZagPrint(Tree *root)
{
    stack<Tree *> curStack, nextStack, *s1, *s2;
    s1 = &curStack;
    s2 = &nextStack;
    int curLevel = 1, nextLevel = 0;
    int leftToRight = 1;
    s1->push(root);
    while(!s1->empty()) {
        Tree *cur = s1->top();
        s1->pop();
        cout << cur->data << " ";
        curLevel--;
        if (leftToRight) {
            if (cur->left) {
                s2->push(cur->left);
                 nextLevel++;
            }
            if (cur->right) {
                s2->push(cur->right);
                nextLevel++;
            }   
        } else {
            if (cur->right) {
                s2->push(cur->right);
                nextLevel++;
            }   
            if (cur->left) {
                s2->push(cur->left);
                nextLevel++;
            }
        }
        if (curLevel == 0) {
            curLevel = nextLevel;
            nextLevel = 0;
            leftToRight = 1-leftToRight;
            stack<Tree *> *tmp = s1;
            s1 = s2;
            s2 = tmp;
            cout << endl;
        }
    }
}

int main(int argc, char **argv)
{
    int input[] = {21,7,5,6,3,2,1,4,6,23,43,54,12,54,8,10,11,35,56};
    //int input[] = {7};
    Tree *root = NULL, *root2 = NULL;
    int result;

    for (int i = 0; i < sizeof(input)/sizeof(int); i++) {
        TreeInsert(root, input[i]);
    }
    print_ascii_tree(root);
    zigZagPrint(root);
}
